/**
   CS 305 & 503, Data Structures and Algorithms
   Programming Assignment 2, Fall 2010

   Possible algorithm execution-time bounds, as a function of input size in
   buildings.  These bounds should be considered tight; that is, given a
   particular bounds on an algorithm's performance, it should not be possible
   to correctly estimate the algorithm's performance with a lower bound.

   For example, an algorithm with liner performance can also be estimated to
   have n-squared performance, but the n-squared estimate is not tight because
   the algorithm's performance can also be correctly estimated as linear, a
   bound lower than n-squared.  
*/

enum AlgorithmPerformance {
  linear,
  nlogn,
  nsquared
  }


// $Log: AlgorithmPerformance.java,v $
// Revision 1.1  2010/10/21 16:06:16  rclayton
// Initial revision
//
